首页> 外文OA文献 >Stable, robust and super fast reconstruction of tensors using multi-way projections
【2h】

Stable, robust and super fast reconstruction of tensors using multi-way projections

机译:使用多路投影进行张量的稳定,鲁棒和超快速重建

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In the framework of multidimensional Compressed Sensing (CS), we introduce an analytical reconstruction formula that allows one to recover an Nth-order data tensor X from a reduced set of multi-way compressive measurements by exploiting its low multilinear-rank structure. Moreover, we show that, an interesting property of multi-way measurements allows us to build the reconstruction based on compressive linear measurements taken only in two selected modes, independently of the tensor order N. In addition, it is proved that, in the matrix case and in a particular case with 3rd-order tensors where the same 2D sensor operator is applied to all mode-3 slices, the proposed reconstruction X is stable in the sense that the approximation error is comparable to the one provided by the best low-multilinear-rank approximation, where is a threshold parameter that controls the approximation error. Through the analysis of the upper bound of the approximation error we show that, in the 2D case, an optimal value for the threshold parameter t = 0 > 0 exists, which is confirmed by our simulation results. On the other hand, our experiments on 3D datasets show that very good reconstructions are obtained using t = 0, which means that this parameter does not need to be tuned. Our extensive simulation results demonstrate the stability and robustness of the method when it is applied to real-world 2D and 3D signals. A comparison with state-of-the-arts sparsity based CS methods specialized for multidimensional signals is also included. A very attractive characteristic of the proposed method is that it provides a direct computation, i.e. it is non iterative in contrast to all existing sparsity based CS algorithms, thus providing super fast computations, even for large datasets.
机译:在多维压缩感知(CS)的框架中,我们引入了一种解析重建公式,该公式允许开发人员利用其低的多线性秩结构从一组减少的多向压缩测量中恢复N阶数据张量X。此外,我们表明,多向测量的一个有趣特性使我们能够基于仅在两个选定模式下进行的压缩线性测量来构建重构,而与张量阶数N无关。此外,证明了在矩阵中情况下,以及在特定的情况下,即在所有模式3切片上都应用了相同的2D传感器算符的三阶张量的情况下,在近似误差与最佳低阶近似误差可比的意义上,建议的重构X是稳定的多线性秩近似,其中是控制近似误差的阈值参数。通过分析逼近误差的上限,我们表明,在二维情况下,存在阈值参数t = 0> 0的最佳值,这已由我们的仿真结果证实。另一方面,我们在3D数据集上的实验表明,使用t = 0可以获得非常好的重构,这意味着不需要调整此参数。我们广泛的仿真结果证明了该方法应用于实际2D和3D信号时的稳定性和鲁棒性。还包括与针对多维信号的基于稀疏性的CS方法的比较。所提出的方法的一个非常吸引人的特征是它提供了直接计算,即,与所有现有的基于稀疏性的CS算法相比,它是非迭代的,从而即使对于大型数据集也提供了超快速的计算。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号